Defining Cost Functions and Profitability Measures for Digraphs Associated with Raster Terms

نویسندگان

  • Pascal Matsakis
  • Julien Gadiou
  • Jacky Desachy
چکیده

Multiscale Edge Detection via Normal Changes p. 22 Extending Adjacency to Fuzzy Sets for Coping with Imprecise Image Objects p. 30 Adaptive Selection of Image Classifiers p. 38 Classification Reliability and Its Use in Multi-classifier Systems p. 46 Color Linear Model p. 54 A Computational Approach to Color Illusions p. 62 Improved Textured Images Segmentation Using an Energy Functional p. 70 Contribution to the Colour Segmentation by Means of an Algorithm Which Reduces the CCDs Saturation Problems p. 79

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Defining Cost Functions and Profitability Measures for Digraphs Associated with Raster DEMs

With a raster Digital Elevation Model, it is usual to associate a directed graph. Firstly, the problem of defining cost functions for such digraphs is discussed in a general and formal framework, and a particularly simple and natural way to tackle this problem is proposed. Secondly, the notion of profitability, which is commonly linked with the notion of cost, is put forward. Thus, profitabilit...

متن کامل

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

متن کامل

The Italian domatic number of a digraph

An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...

متن کامل

A note on the Roman domatic number of a digraph

Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....

متن کامل

Common fixed points for a pair of mappings in $b$-Metric spaces via digraphs and altering distance functions

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of self-mappings satisfying some generalized contractive type conditions in $b$-metric spaces endowed with graphs and altering distance functions. Finally, some examples are provided to justify the validity of our results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997